Algebraic closures in complexity theory
نویسنده
چکیده
منابع مشابه
3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملAn Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the geometric complexity theory program to prove a variant of Valiant’s algebraic analogue of the P = NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.
متن کاملAn overview of mathematical issues arising in the Geometric complexity theory approach to VP v.s. VNP
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant’s algebraic analog of the P 6= NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.
متن کاملAn Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to Vp 6= Vnp
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant’s algebraic analog of the P 6= NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.
متن کاملJ an 2 01 1 AN OVERVIEW OF MATHEMATICAL ISSUES ARISING IN THE GEOMETRIC COMPLEXITY THEORY APPROACH TO VP 6 = VNP
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant’s algebraic analog of the P 6= NP conjecture. We also describe the precise separation of complexity classes that their program proposes to demonstrate.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005